منابع مشابه
Linkages in Polytope Graphs
A graph is k-linked if any k disjoint vertex-pairs can be joined by k disjoint paths. We improve a lower bound on the linkedness of polytopes slightly, which results in exact values for the minimal linkedness of 7-, 10and 13-dimensional polytopes. We analyze in detail linkedness of polytopes on at most (6d + 7)/5 vertices. In that case, a sharp lower bound on minimal linkedness is derived, and ...
متن کاملRealizability of Graphs and Linkages
We show that deciding whether a graph with given edge lengths can be realized by a straight-line drawing has the same complexity as deciding the truth of sentences in the existential theory of the real numbers, ETR; we introduce the class ∃R that captures the computational complexity of ETR and many other problems. The graph realizability problem remains ∃R-complete if all edges have unit lengt...
متن کاملTight Bounds for Linkages in Planar Graphs
The Disjoint-Paths Problem asks, given a graph G and a set of pairs of terminals (s1, t1), . . . , (sk, tk), whether there is a collection of k pairwise vertex-disjoint paths linking si and ti, for i = 1, . . . , k. In their f(k) · n algorithm for this problem, Robertson and Seymour introduced the irrelevant vertex technique according to which in every instance of treewidth greater than g(k) th...
متن کاملDirected graphs, decompositions, and spatial linkages
The decomposition of a linkage into minimal components is a central tool of analysis and synthesis of linkages. In this paper we prove that every pinned d-isostatic (minimally rigid) graph (grounded linkage) has a unique decomposition into minimal strongly connected components (in the sense of directed graphs), or equivalently intominimal pinned isostatic graphs, which we call d-Assur graphs. W...
متن کاملGraph minors. XXI. Graphs with unique linkages
A linkage L in a graph G is a subgraph each component of which is a path, and it is vital if V (L) = V (G) and there is no other linkage in G joining the same pairs of vertices. We show that, if G has a vital linkage with p components, then G has tree-width bounded above by a function of p. This is the major step in the proof of the unproved lemma from Graph Minors XIII, and it has a number of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2008
ISSN: 1571-0653
DOI: 10.1016/j.endm.2008.06.038